// Copyright 2006-2008 the V8 project authors. All rights reserved.
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
//     * Redistributions of source code must retain the above copyright
//       notice, this list of conditions and the following disclaimer.
//     * Redistributions in binary form must reproduce the above
//       copyright notice, this list of conditions and the following
//       disclaimer in the documentation and/or other materials provided
//       with the distribution.
//     * Neither the name of Google Inc. nor the names of its
//       contributors may be used to endorse or promote products derived
//       from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.


// This is a JavaScript implementation of the Richards
// benchmark from:
//
//    http://www.cl.cam.ac.uk/~mr10/Bench.html
//
// The benchmark was originally implemented in BCPL by
// Martin Richards.

//import base = require('./base');
//let BenchmarkSuite = base.BenchmarkSuite;
//let Benchmark = base.Benchmark;

"use strict";

type int = number;

namespace rd {

const COUNT = 1000;

/**
 * These two constants specify how many times a packet is queued and
 * how many times a task is put on hold in a correct run of richards.
 * They don't have any meaning a such but are characteristic of a
 * correct run so if the actual queue or hold count is different from
 * the expected there must be a bug in the implementation.
 **/
const EXPECTED_QUEUE_COUNT = 2322;
const EXPECTED_HOLD_COUNT = 928;



const NULL_ID       = -1;
const ID_IDLE       = 0;
const ID_WORKER     = 1;
const ID_HANDLER_A  = 2;
const ID_HANDLER_B  = 3;
const ID_DEVICE_A   = 4;
const ID_DEVICE_B   = 5;
const NUMBER_OF_IDS = 6;


const KIND_DEVICE   = 0;
const KIND_WORK     = 1;


class Scheduler {

  queueCount: int;
  holdCount: int;
  private blocks: TaskControlBlock[];
  list: TaskControlBlock;
  currentTcb: TaskControlBlock;
  currentId: int;
  /**
   * A scheduler can be used to schedule a set of tasks based on their relative
   * priorities.  Scheduling is done by maintaining a list of task control blocks
   * which holds tasks and the data queue they are processing.
   * @constructor
   */
  constructor() {
    this.queueCount = 0;
    this.holdCount = 0;
    this.blocks = new Array(NUMBER_OF_IDS);
    this.list = null;
    this.currentTcb = null;
    this.currentId = NULL_ID;
  }

  /**
   * Add an idle task to this scheduler.
   * @param {int} id the identity of the task
   * @param {int} priority the task's priority
   * @param {Packet} queue the queue of work to be processed by the task
   * @param {int} count the number of times to schedule the task
   */
  addIdleTask(id: int, priority: int, queue: Packet, count: int) {
    this.addRunningTask(id, priority, queue, new IdleTask(this, 1, count));
  };

  /**
   * Add a work task to this scheduler.
   * @param {int} id the identity of the task
   * @param {int} priority the task's priority
   * @param {Packet} queue the queue of work to be processed by the task
   */
  addWorkerTask(id: int, priority: int, queue: Packet) {
    this.addTask(id, priority, queue, new WorkerTask(this, ID_HANDLER_A, 0));
  };

  /**
   * Add a handler task to this scheduler.
   * @param {int} id the identity of the task
   * @param {int} priority the task's priority
   * @param {Packet} queue the queue of work to be processed by the task
   */
  addHandlerTask(id: int, priority: int, queue: Packet) {
    this.addTask(id, priority, queue, new HandlerTask(this));
  };

  /**
   * Add a handler task to this scheduler.
   * @param {int} id the identity of the task
   * @param {int} priority the task's priority
   * @param {Packet} queue the queue of work to be processed by the task
   */
  addDeviceTask(id: int, priority: int, queue: Packet) {
    this.addTask(id, priority, queue, new DeviceTask(this))
  };

  /**
   * Add the specified task and mark it as running.
   * @param {int} id the identity of the task
   * @param {int} priority the task's priority
   * @param {Packet} queue the queue of work to be processed by the task
   * @param {Task} task the task to add
   */
  private addRunningTask(id: int, priority: int, queue: Packet, task: Task) {
    this.addTask(id, priority, queue, task);
    this.currentTcb.setRunning();
  };

  /**
   * Add the specified task to this scheduler.
   * @param {int} id the identity of the task
   * @param {int} priority the task's priority
   * @param {Packet} queue the queue of work to be processed by the task
   * @param {Task} task the task to add
   */
  private addTask(id: int, priority: int, queue: Packet, task: Task) {
    this.currentTcb = new TaskControlBlock(this.list, id, priority, queue, task);
    this.list = this.currentTcb;
    this.blocks[id] = this.currentTcb;
  };

  /**
   * Execute the tasks managed by this scheduler.
   */
  schedule() {
    this.currentTcb = this.list;
    while (this.currentTcb != null) {
      if (this.currentTcb.isHeldOrSuspended()) {
        this.currentTcb = this.currentTcb.link;
      } else {
        this.currentId = this.currentTcb.id;
        this.currentTcb = this.currentTcb.run();
      }
    }
  };

  /**
   * Release a task that is currently blocked and return the next block to run.
   * @param {int} id the id of the task to suspend
   */
  release(id: int) {
    var tcb = this.blocks[id];
    if (tcb == null) return tcb;
    tcb.markAsNotHeld();
    if (tcb.priority > this.currentTcb.priority) {
      return tcb;
    } else {
      return this.currentTcb;
    }
  };

  /**
   * Block the currently executing task and return the next task control block
   * to run.  The blocked task will not be made runnable until it is explicitly
   * released, even if new work is added to it.
   */
  holdCurrent() {
    this.holdCount++;
    this.currentTcb.markAsHeld();
    return this.currentTcb.link;
  };

  /**
   * Suspend the currently executing task and return the next task control block
   * to run.  If new work is added to the suspended task it will be made runnable.
   */
  suspendCurrent() {
    this.currentTcb.markAsSuspended();
    return this.currentTcb;
  };

  /**
   * Add the specified packet to the end of the worklist used by the task
   * associated with the packet and make the task runnable if it is currently
   * suspended.
   * @param {Packet} packet the packet to add
   */
  queue(packet: Packet) {
    var t = this.blocks[packet.id];
    if (t == null) return t;
    this.queueCount++;
    packet.link = null;
    packet.id = this.currentId;
    return t.checkPriorityAdd(this.currentTcb, packet);
  };
}



/**
 * The task is running and is currently scheduled.
 */
const STATE_RUNNING = 0;

/**
 * The task has packets left to process.
 */
const STATE_RUNNABLE = 1;

/**
 * The task is not currently running.  The task is not blocked as such and may
* be started by the scheduler.
 */
const STATE_SUSPENDED = 2;

/**
 * The task is blocked and cannot be run until it is explicitly released.
 */
const STATE_HELD = 4;

const STATE_SUSPENDED_RUNNABLE = STATE_SUSPENDED | STATE_RUNNABLE;
const STATE_NOT_HELD = ~STATE_HELD;

class TaskControlBlock {
  link: TaskControlBlock;
  id: int;
  priority: int;
  queue: Packet;
  task: Task;
  state: int;
  /**
   * A task control block manages a task and the queue of work packages associated
   * with it.
   * @param {TaskControlBlock} link the preceding block in the linked block list
   * @param {int} id the id of this block
   * @param {int} priority the priority of this block
   * @param {Packet} queue the queue of packages to be processed by the task
   * @param {Task} task the task
   * @constructor
   */
  constructor(link: TaskControlBlock, id: int, priority: int, queue: Packet, task: Task) {
    this.link = link;
    this.id = id;
    this.priority = priority;
    this.queue = queue;
    this.task = task;
    if (queue == null) {
      this.state = STATE_SUSPENDED;
    } else {
      this.state = STATE_SUSPENDED_RUNNABLE;
    }
  }

  setRunning() {
    this.state = STATE_RUNNING;
  };

  markAsNotHeld() {
    this.state = <int>(this.state & STATE_NOT_HELD);
  };

  markAsHeld() {
    this.state = this.state | STATE_HELD;
  };

  isHeldOrSuspended() {
    return (this.state & STATE_HELD) != 0 || (this.state == STATE_SUSPENDED);
  };

  markAsSuspended() {
    this.state = this.state | STATE_SUSPENDED;
  };

  private markAsRunnable() {
    this.state = this.state | STATE_RUNNABLE;
  };

  /**
   * Runs this task, if it is ready to be run, and returns the next task to run.
   */
  run() {
    var packet: Packet;
    if (this.state == STATE_SUSPENDED_RUNNABLE) {
      packet = this.queue;
      this.queue = packet.link;
      if (this.queue == null) {
        this.state = STATE_RUNNING;
      } else {
        this.state = STATE_RUNNABLE;
      }
    } else {
      packet = null;
    }
    return this.task.run(packet);
  };

  /**
   * Adds a packet to the worklist of this block's task, marks this as runnable if
   * necessary, and returns the next runnable object to run (the one
   * with the highest priority).
   */
  checkPriorityAdd(task: TaskControlBlock, packet: Packet) {
    if (this.queue == null) {
      this.queue = packet;
      this.markAsRunnable();
      if (this.priority > task.priority) return this;
    } else {
      this.queue = packet.addTo(this.queue);
    }
    return task;
  };

  toString() {
    return "tcb { " + this.task + "@" + this.state + " }";
  };
}

class Task {
  run(packet: Packet): TaskControlBlock { return undefined; }
}


class IdleTask extends Task {
  scheduler: Scheduler;
  v1: int;
  count: int;
  /**
   * An idle task doesn't do any work itself but cycles control between the two
   * device tasks.
   * @param {Scheduler} scheduler the scheduler that manages this task
   * @param {int} v1 a seed value that controls how the device tasks are scheduled
   * @param {int} count the number of times this task should be scheduled
   * @constructor
   */
  constructor(scheduler: Scheduler, v1: int, count: int) {
    super();
    this.scheduler = scheduler;
    this.v1 = v1;
    this.count = count;
  }

  run(packet: Packet) {
    this.count--;
    if (this.count == 0) return this.scheduler.holdCurrent();
    if ((this.v1 & 1) == 0) {
      this.v1 = this.v1 >> 1;
      return this.scheduler.release(ID_DEVICE_A);
    } else {
      this.v1 = (this.v1 >> 1) ^ 0xD008;
      return this.scheduler.release(ID_DEVICE_B);
    }
  }

  toString() {
    return "IdleTask"
  };
}


class DeviceTask extends Task {
  scheduler: Scheduler;
  v1: Packet;
  /**
   * A task that suspends itself after each time it has been run to simulate
   * waiting for data from an external device.
   * @param {Scheduler} scheduler the scheduler that manages this task
   * @constructor
   */
  constructor(scheduler: Scheduler) {
    super();
    this.scheduler = scheduler;
    this.v1 = null;
  }

  run(packet: Packet) {
    if (packet == null) {
      if (this.v1 == null) return this.scheduler.suspendCurrent();
      var v = this.v1;
      this.v1 = null;
      return this.scheduler.queue(v);
    } else {
      this.v1 = packet;
      return this.scheduler.holdCurrent();
    }
  }

  toString() {
    return "DeviceTask";
  }
}


class WorkerTask extends Task {
  scheduler: Scheduler;
  v1: int;
  v2: int;
  /**
   * A task that manipulates work packets.
   * @param {Scheduler} scheduler the scheduler that manages this task
   * @param {int} v1 a seed used to specify how work packets are manipulated
   * @param {int} v2 another seed used to specify how work packets are manipulated
   * @constructor
   */
  constructor(scheduler: Scheduler, v1: int, v2: int) {
    super();
    this.scheduler = scheduler;
    this.v1 = v1;
    this.v2 = v2;
  }

  run(packet: Packet) {
    if (packet == null) {
      return this.scheduler.suspendCurrent();
    } else {
      if (this.v1 == ID_HANDLER_A) {
        this.v1 = ID_HANDLER_B;
      } else {
        this.v1 = ID_HANDLER_A;
      }
      packet.id = this.v1;
      packet.a1 = 0;
      for (var i = 0; i < DATA_SIZE; i++) {
        this.v2++;
        if (this.v2 > 26) this.v2 = 1;
        packet.a2[i] = this.v2;
      }
      return this.scheduler.queue(packet);
    }
  }

  toString() {
    return "WorkerTask";
  }
}


class HandlerTask extends Task {
  scheduler: Scheduler;
  v1: Packet;
  v2: Packet;
  /**
   * A task that manipulates work packets and then suspends itself.
   * @param {Scheduler} scheduler the scheduler that manages this task
   * @constructor
   */
  constructor(scheduler: Scheduler) {
    super();
    this.scheduler = scheduler;
    this.v1 = null;
    this.v2 = null;
  }

  run(packet: Packet) {
    if (packet != null) {
      if (packet.kind == KIND_WORK) {
        this.v1 = packet.addTo(this.v1);
      } else {
        this.v2 = packet.addTo(this.v2);
      }
    }
    if (this.v1 != null) {
      var count = this.v1.a1;
      var v: Packet;
      if (count < DATA_SIZE) {
        if (this.v2 != null) {
          v = this.v2;
          this.v2 = this.v2.link;
          v.a1 = this.v1.a2[count];
          this.v1.a1 = count + 1;
          return this.scheduler.queue(v);
        }
      } else {
        v = this.v1;
        this.v1 = this.v1.link;
        return this.scheduler.queue(v);
      }
    }
    return this.scheduler.suspendCurrent();
  }

  toString() {
    return "HandlerTask";
  }
}

/* --- *
 * P a c k e t
 * --- */

const DATA_SIZE = 4;


class Packet {
  link: Packet;
  id: int;
  kind: int;
  a1: int;
  a2: int[];
  /**
   * A simple package of data that is manipulated by the tasks.  The exact layout
   * of the payload data carried by a packet is not importaint, and neither is the
   * nature of the work performed on packets by the tasks.
   *
   * Besides carrying data, packets form linked lists and are hence used both as
   * data and worklists.
   * @param {Packet} link the tail of the linked list of packets
   * @param {int} id an ID for this packet
   * @param {int} kind the type of this packet
   * @constructor
   */
  constructor(link: Packet, id: int, kind: int) {
    this.link = link;
    this.id = id;
    this.kind = kind;
    this.a1 = 0;
    this.a2 = new Array(DATA_SIZE);
  }

  /**
   * Add this packet to the end of a worklist, and return the worklist.
   * @param {Packet} queue the worklist to add this packet to
   */
  addTo(queue: Packet) {
    this.link = null;
    if (queue == null) return this;
    var peek: Packet, next = queue;
    while ((peek = next.link) != null)
      next = peek;
    next.link = this;
    return queue;
  };

  toString() {
    return "Packet";
  };
}

/**
 * The Richards benchmark simulates the task dispatcher of an
 * operating system.
 **/
export function runRichards() {
  var scheduler = new Scheduler();
  scheduler.addIdleTask(ID_IDLE, 0, null, COUNT);

  var queue = new Packet(null, ID_WORKER, KIND_WORK);
  queue = new Packet(queue,  ID_WORKER, KIND_WORK);
  scheduler.addWorkerTask(ID_WORKER, 1000, queue);

  queue = new Packet(null, ID_DEVICE_A, KIND_DEVICE);
  queue = new Packet(queue,  ID_DEVICE_A, KIND_DEVICE);
  queue = new Packet(queue,  ID_DEVICE_A, KIND_DEVICE);
  scheduler.addHandlerTask(ID_HANDLER_A, 2000, queue);

  queue = new Packet(null, ID_DEVICE_B, KIND_DEVICE);
  queue = new Packet(queue,  ID_DEVICE_B, KIND_DEVICE);
  queue = new Packet(queue,  ID_DEVICE_B, KIND_DEVICE);
  scheduler.addHandlerTask(ID_HANDLER_B, 3000, queue);

  scheduler.addDeviceTask(ID_DEVICE_A, 4000, null);

  scheduler.addDeviceTask(ID_DEVICE_B, 5000, null);

  scheduler.schedule();

  if (scheduler.queueCount != EXPECTED_QUEUE_COUNT ||
      scheduler.holdCount != EXPECTED_HOLD_COUNT) {
    var msg =
        "Error during execution: queueCount = " + scheduler.queueCount +
        ", holdCount = " + scheduler.holdCount + ".";
    throw new Error(msg);
  }
}

}

// var Richards = new BenchmarkSuite('Richards', 35302, [
//   new Benchmark("Richards", rd.runRichards)
// ]);

declare function alert(message?: string): void;
//declare var console : { log: (string) => void };
declare function print(str:any):string;

// declare const print: (message: string)=>void;
// declare class performance {
//   static now(): number;
// }

let worst4: number;
let average: number;
let firstIteration: number;
let total: number;

function summation(values: Object[]) {
    assert(values instanceof Array);
    let sum = 0;
    for (let x of values)
      sum = sum + <number>x;
    return sum;
}

function toScore(timeValue: Object) {
  return <number>timeValue;
}

function mean(values: Object[]) {
  assert(values instanceof Array);
  let sum: number = 0;
  for (let x of values)
      sum = sum + <number>x;
  return sum / values.length;
}

function assert(condition: boolean) {
  if (!condition) {
    throw new Error("assert false");
  }
}

function processResults(results: Object[]) {
  function copyArray(a: Object[]) {
      let result = [];
      for (let x of a)
          result.push(x);
      return result;
  }
  results = copyArray(results);
  firstIteration = toScore(results[0]);
  total = summation(results)

  results = results.slice(1);
  results.sort((a, b) => a < b ? 1 : -1);
  for (let i = 0; i + 1 < results.length; ++i)
      assert(results[i] >= results[i + 1]);

  let worstCase: Object[] = [];
  for (let i = 0; i < 4; ++i)
      worstCase.push(results[i]);
  worst4 = toScore(mean(worstCase));
  average = toScore(mean(results));
}

function printScore() { 
  print("First: " + firstIteration);
  print("worst4: " + worst4);
  print("average: " + average);
  print("richards_total : " + total);
}

class Benchmark {
  runIteration() {
    rd.runRichards()
  }
}


function main() {
    let __benchmark = new Benchmark();
    let results = [];
    for (let i = 0; i < 120; i++) {
        let start = (new Date()).getTime();
        __benchmark.runIteration();
        let end = (new Date()).getTime();

        results.push(end - start);
    }
    processResults(results);
    printScore();
}
main();

